On k-greedy routing algorithms
نویسندگان
چکیده
منابع مشابه
Greedy online algorithms for routing permanent virtual circuits
We analyze the competitive ratio of two greedy online algorithms for routing permanent virtual circuits in a network with arbitrary topology and uniform capacity links. We show that the competitive ratio of the first algorithm, with respect to network congestion, is in V(=$m) and O(=$+m), where m is the number of links in the network, $ is the maximum ratio, over all requests, of the length of ...
متن کاملGreedy geographic routing algorithms in a real environment
Existing theoretical and simulation studies on georouting appear detached from experimental studies in real environments. We set up our test environment by using WSN430 wireless sensor nodes. To overcome the need for significant number of wireless nodes required to perform a realistic experiment in high density network, we introduce a novel approach emulation by using relatively small number of...
متن کاملOn performance of greedy algorithms
In this paper we show that for dictionaries with small coherence in a Hilbert space the Orthogonal Greedy Algorithm (OGA) performs almost as well as the best m−term approximation for all signals with sparsity almost as high as the best theoretically possible threshold s = 1 2 (M−1 + 1) by proving a Lebesgue-type inequality for arbitrary signals. On the other hand, we present an example of a dic...
متن کاملSome remarks on greedy algorithms
There has recently been much interest in approximation by linear combinations of functions taken from a redundant set 79. That is, the elements of 79 are not linearly independent. Perhaps the first example of this type was considered by Schmidt in 1907 [6] who considered the approximation of functions f ( x , y ) of two variables by bilinear forms ~-~tfl=lUi(X)Vi(y ) in L2([0,112). This problem...
متن کاملGreedy Approximation Algorithms for K-Medians by Randomized Rounding
We give an improved approximation algorithm for the general kmedians problem. Given any > 0, the algorithm nds a solution of total distance at most D(1 + ) using at most k ln(n + n= ) medians (a.k.a. sites), provided some solution of total distance D using k medians exists. This improves over the best previous bound (w.r.t. the number of medians) by a factor of (1= ) provided 1= = n. The algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2016
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2015.10.008